Three new upper bounds on the chromatic number
نویسندگان
چکیده
منابع مشابه
Two Upper Bounds on the Chromatic Number
Processor cache memory management is a challenging issue as it deeply impact performances and power consumption of electronic devices. It has been shown that allocating data structures to memory for a given application (as MPEG encoding, filtering or any other signal processing application) can be modeled as a minimum k-weighted graph coloring problem, on the so-called conflict graph. The graph...
متن کاملUpper Bounds of Dynamic Chromatic Number
A proper vertex k-coloring of a graph G is dynamic if for every vertex v with degree at least 2, the neighbors of v receive at least two different colors. The smallest integer k such that G has a dynamic k-coloring is the dynamic chromatic number χd(G). We prove in this paper the following best possible upper bounds as an analogue to Brook’s Theorem, together with the determination of chromatic...
متن کاملUpper bounds for the chromatic number of a graph
For a connected graph G of order n, the clique number ω(G), the chromatic number χ(G) and the independence number α(G) satisfy ω(G) ≤ χ(G) ≤ n − α(G) + 1. We will show that the arithmetic mean of the previous lower and upper bound provides a new upper bound for the chromatic number of a graph.
متن کاملA new upper bound on the cyclic chromatic number
A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χc . Let ∗ be themaximum face degree of a graph. There exist plane graphs with χc = 2 ∗ . Ore and Plummer [5] proved that χc ≤ 2 ∗, which bound was improved to 5 ∗ by Borodin, Sand...
متن کاملSpectral Bounds on the Chromatic Number
The purpose of this paper is to discuss spectral bounds on the chromatic number of a graph. The classic result by Hoffman, where λ1 and λn are respectively the maximum and minimum eigenvalues of the adjacency matrix of a graph G, is χ(G) ≥ 1− λ1 λn . It is possible to discuss the coloring of Hermitian matrices in general. Nikiforov developed a spectral bound on the chromatic number of such matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.005